Informationally Robust Optimal Auction Design

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Informationally Robust Optimal Auction Design∗

A single unit of a good is to be sold by auction to one of two buyers. The good has either a high value or a low value, with known prior probabilities. The designer of the auction knows the prior over values but is uncertain about the correct model of the buyers’ beliefs. The designer evaluates a given auction design by the lowest expected revenue that would be generated across all models of bu...

متن کامل

INFORMATIONALLY ROBUST OPTIMAL AUCTION DESIGN By

A single unit of a good is to be sold by auction to one of two buyers. The good has either a high value or a low value, with known prior probabilities. The designer of the auction knows the prior over values but is uncertain about the correct model of the buyers' beliefs. The designer evaluates a given auction design by the lowest expected revenue that would be generated across all models of bu...

متن کامل

Optimal auction design with common values: An informationally-robust approach∗

A Seller can sell a single unit of a good to a group of bidders. The good is costly to produce, and the bidders have a pure common value that may be higher or lower than the production cost. The value is drawn from a prior distribution that is commonly known. The Seller does not know the bidders’ beliefs about the value and values each auction mechanism according to the lowest expected profit a...

متن کامل

Optimal Auction Design

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

متن کامل

Informationally Robust Equilibria

Informationally Robust Equilibria (IRE) are introduced in Robson (1994) as a refinement of Nash equilibria for e.g. bimatrix games, i.e. mixed extensions of two person finite games. Similar to the concept of perfect equilibria, basically the idea is that an IRE is a limit of some sequence of equilibria of perturbed games. Here, the perturbation has to do with the hypothetical possibility that t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2016

ISSN: 1556-5068

DOI: 10.2139/ssrn.2886456